Axiomatic Characterization of Game-Theoretic Centrality
نویسندگان
چکیده
منابع مشابه
Game-theoretic Network Centrality: A Review
Game-theoretic centrality is a flexible and sophisticated approach to identify the most important nodes in a network. It builds upon the methods from cooperative game theory and network theory. The key idea is to treat nodes as players in a cooperative game, where the value of each coalition is determined by certain graph-theoretic properties. Using solution concepts from cooperative game theor...
متن کاملFast Algorithms for Game-Theoretic Centrality Measures
In this dissertation, we analyze the computational properties of game-theoretic centrality measures. The key idea behind game-theoretic approach to network analysis is to treat nodes as players in a cooperative game, where the value of each coalition of nodes is determined by certain graph properties. Next, the centrality of any individual node is determined by a chosen game-theoretic solution ...
متن کاملA Generic Axiomatic Characterization of Centrality Measures in Social Network
Centrality is an important notion in complex networks; it could be used to characterize how influential a node or an edge is in the network. It plays an important role in several other network analysis tools including community detection. Even though there are a small number of axiomatic frameworks associated with this notion, the existing formalizations are not generic in nature. In this paper...
متن کاملEfficient Computation of Semivalues for Game-Theoretic Network Centrality
Solution concepts from cooperative game theory, such as the Shapley value or the Banzhaf index, have recently been advocated as interesting extensions of standard measures of node centrality in networks. While this direction of research is promising, the computation of game-theoretic centrality can be challenging. In an attempt to address the computational issues of game-theoretic network centr...
متن کاملGame theoretic network centrality: exact formulas and efficient algorithms
The concept of centrality plays an important role in network analysis. Game theoretic centrality measures have been recently proposed, which are based on computing the Shapley Value (SV) of each node (agent) in a suitably constructed co-operative network game (for example see [1]). However, the naive method of exact computation of SVs takes exponential time in the number of nodes. In this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2018
ISSN: 1076-9757
DOI: 10.1613/jair.1.11202